Dynamic tuning of algorithmic parameters of parallel scientific codes

نویسندگان

  • Pilsung Kang
  • Naresh K. C. Selvarasu
  • Naren Ramakrishnan
  • Calvin J. Ribbens
  • Danesh K. Tafti
  • Srinidhi Varadarajan
چکیده

We present a dynamic method for tuning algorithmic parameters of parallel scientific programs. By treating tuning as a separate concern in the software development process, our method supports personalized development of optimization schemes for existing programs that are not easily supported by conventional tuning techniques. We use a compositional framework to transparently combine tuning code with the original program without direct modification of an existing code base. In this way, the inserted tuning module can dynamically search for optimal values of algorithmic parameters, accounting for runtime factors such as input problem size and parallel characteristics of a given execution platform, as well as the architectural or runtime properties of a single machine of the platform. Applying our method to a parallel CFD (computational fluid dynamics) simulation, we demonstrate how a set of performancecritical parameters can be dynamically tuned, achieving up to 26% performance improvements over average cases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tuning HipGISAXS on Multi and Many Core Supercomputers

With the continual development of multi and manycore architectures, there is a constant need for architecturespecific tuning of application-codes in order to realize high computational performance and energy efficiency, closer to the theoretical peaks of these architectures. In this paper, we present optimization and tuning of HipGISAXS, a parallel X-ray scattering simulation code [1], on vario...

متن کامل

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

متن کامل

Parallel Genetic Algorithm Using Algorithmic Skeleton

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

متن کامل

An ANOVA Based Analytical Dynamic Matrix Controller Tuning Procedure for FOPDT Models

Dynamic Matrix Control (DMC) is a widely used model predictive controller (MPC) in industrial plants. The successful implementation of DMC in practical applications requires a proper tuning of the controller. The available tuning procedures are mainly based on experience and empirical results. This paper develops an analytical tool for DMC tuning. It is based on the application of Analysis of V...

متن کامل

Performance Prediction for Parallel Local Weather Forecast Programs

a a ABSTRACT: Performance modeling for scientific production codes is of interest both for program tuning and for the selection of new machines. An empirical method is used for developing a model to predict the runtime of large parallel weather prediction programs. The different steps of the method are outlined giving examples from two different programs of the DWD (German Weather Service). The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010